Unimodular Minimal Structures
نویسنده
چکیده
A strongly minimal structure D is called unimodular if any two finite-to-one maps with the same domain and range have the same degree; that is if/4: (/-»• V is everywhere fc4-to-l, then kx = kc,. THEOREM. Unimodular strongly minimal structures are locally modular. This extends Zil'ber's theorem on locally finite strongly minimal sets, Urbanik's theorem on free algebras with the Steinitz property, and applies also to minimal types in N0-categorical stable theories.
منابع مشابه
A Note on Optimal Unimodular Lattices
The highest possible minimal norm of a unimodular lattice is determined in dimensions n ≤ 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8.1020 in dimension 33). Unimodular lattices with no roots exist if and only if n ≥ 23, n 6= 25.
متن کاملAutomorphisms of extremal unimodular lattices in dimension 72
The paper narrows down the possible automorphisms of extremal even unimodular lattices of dimension 72. With extensive computations in Magma using the very sophisticated algorithm for computing class groups of algebraic number fields written by Steve Donnelly it is shown that the extremal even unimodular lattice Γ72 from [17] is the unique extremal even unimodular lattice of dimension 72 that a...
متن کاملStrongly minimal pseudofinite structures
In this note we point out that any strongly minimal pseudofinite structure (or set) is unimodular in the sense of [1], [5], [2], and hence measurable in the sense of Macpherson and Steinhorn [3], [2] as well as 1-based. The argument, involving nonstandard finite cardinalities, is straightforward. A few people asked about this issue in private conversations and communications, in particular Mart...
متن کاملMinimal Data Dependence
Many abstractions of program dependences have already been proposed, such as the Dependence Distance, the Dependence Direction Vector, the Dependence Level or the Dependence Cone. These diierent abstractions have diierent precisions. The minimal abstraction associated to a transformation is the abstraction that contains the minimal amount of information necessary to decide when such a transform...
متن کاملUnimodular Probing for Minimal Perturbance in Dynamic Resource Feasibility Problems
This paper describes unimodular probing { a new technique that has been used to solve a class of dynamic scheduling problems. In benchmarks a unimodular probing algorithm has outperformed two well-established approaches: backtrack search with local consistency and spe-cialised heuristics, and mixed integer programming (MIP). The problems amenable to unimodular probing involve disjunctive constr...
متن کامل